Drag Reduction on Ultra Small-Scale Concave-Convex Surface.

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Drag reduction on a patterned superhydrophobic surface.

We present an experimental study of a low-Reynolds number shear flow between two surfaces, one of which has a regular grooved texture augmented with a superhydrophobic coating. The combination reduces the effective fluid-surface contact area, thereby appreciably decreasing the drag on the surface and effectively changing the macroscopic boundary condition on the surface from no slip to limited ...

متن کامل

Viscous Drag Reduction with Surface-Embedded Grooves

Turbulent drag reduction in wall-bounded flows is investigated experimentally by considering the dynamic effects provoked by large variation of anisotropy in the velocity fluctuations. It is shown that high drag reduction is obtained when the velocity fluctuations near the wall reach the statistically axisymmetric state with invariance under rotation about the axis aligned with the mean flow. D...

متن کامل

Locally Convex (concave) Games

We introduce a new class of cooperative games by using the notion of local supermodularity. Therefore locally convex games can be considered as relaxations of convex games. Moreover, we obtain a characterization of a subclass of locally concave games in terms of the rank function of a matroid.

متن کامل

On convex-concave perception based functions

Perception based function (PBF) is given by the set of rules Ri:“If X is Ti then Y is Si”, where Ti is a linguistic term describing some fuzzy intervals Ai on the domain of real values of X and Si is a linguistic description of the shape of the function Y(X) on this interval. The methods of explicitation of such type of rules when Si are given by words QUICKLY INCREASING AND SLIGHTLY CONVEX, SL...

متن کامل

On Convergence Rate of Concave-Convex Procedure

Concave-Convex Procedure (CCCP) has been widely used to solve nonconvex d.c.(difference of convex function) programs occur in learning problems, such as sparse support vector machine (SVM), transductive SVM, sparse principal componenent analysis (PCA), etc. Although the global convergence behavior of CCCP has been well studied, the convergence rate of CCCP is still an open problem. Most of d.c....

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: TRANSACTIONS OF THE JAPAN SOCIETY OF MECHANICAL ENGINEERS Series B

سال: 2000

ISSN: 0387-5016,1884-8346

DOI: 10.1299/kikaib.66.1085